Solving the TSP using Traditional Computing Approach

Solving TSP using DARO

Travelling Salesperson Problem is finding a Hamiltonian cycle with minimum weight. The paper presents solution travelling salesperson problem with Genetic Algorithm. Dynamic allocation of reproduction operators and social disaster technique are used for generating the population and based on the convergence analysis of evaluation process. The method is demonstrated and found to be effective in ...

Solving the TSP Using Chaotic Simulated Annealing

Solving TSP Using Various Meta-Heuristic Algorithms

Real world problems like Travelling Salesman Problem (TSP) belong to NP-hard optimization problems which are difficult to solve using classical mathematical methods. Therefore, many alternate solutions have been developed to find the optimal solution in shortest possible time. Nature-inspired algorithms are one of the proposed solutions which are successful in finding the solutions that are ver...

the use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach

abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...

Solving the Free Clustered TSP Using a Memetic Algorithm

The free clustered travelling salesman problem (FCTSP) is an extension of the classical travelling salesman problem where the set of vertices is partitioned into clusters, and the task is to find a minimum cost Hamiltonian tour such that the vertices in any cluster are visited contiguously. This paper proposes the use of a memetic algorithm (MA) that combines the global search ability of Geneti...